On Vietoris–Rips complexes of hypercube graphs
نویسندگان
چکیده
We describe the homotopy types of Vietoris–Rips complexes hypercube graphs at small scale parameters. In more detail, let $$Q_n$$ be vertex set graph with $$2^n$$ vertices, equipped shortest path metric. Equivalently, is all binary strings length n, Hamming distance. The complex parameter zero points, and one graph, which equivalent to a wedge sum circles. show that two 3-spheres, furthermore we provide formula for number 3-spheres. Many questions about larger parameters remain open.
منابع مشابه
The cubicity of hypercube graphs
For a graph G, its cubicity cub(G) is the minimum dimension k such that G is representable as the intersection graph of (axis– parallel) cubes in k–dimensional space. (A k–dimensional cube is a Cartesian product R1 × R2 × · · · × Rk, where Ri is a closed interval of the form [ai, ai + 1] on the real line.) Chandran et al. [2] showed that for a d–dimensional hypercube Hd, d−1 log d ≤ cub(Hd) ≤ 2...
متن کاملIncrementally Extensible Folded Hypercube Graphs
In this paper, we propose the incrementally extensible folded hypercube (IEFH) graph as a new class of interconnection networks for an arbitrary number of nodes. We show that this system is optimal fault tolerant and almost regular (i.e., the difference between the maximum and the minimum degree of nodes is at most one). The diameter of this topology is half of that of the incomplete hypercube ...
متن کاملCombinatorial Properties of Generalized Hypercube Graphs
This paper investigates combinatorial properties of generalized hypercube graphs including best containers, wide diameter, and fault diameter. These properties have received much attention recently in the study of interconnection networks.
متن کاملSOLVABILITY OF FREE PRODUCTS, CAYLEY GRAPHS AND COMPLEXES
In this paper, we verify the solvability of free product of finite cyclic groups with topological methods. We use Cayley graphs and Everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. In particular, using these methods, we prove that the commutator subgroup of $mathbb{Z}_{m}*mathbb{Z}_{n}$ is free of rank $(m-1)(n-1)$ fo...
متن کاملInterval Routing for Generalized Hypercube-Like Graphs
Given a parallel or distributed system, the interconnection network ensures the communication between the processors, the terminal nodes. Each intermediate node has a router, a dedicated co-processor which forwards the messages between processors through the links of the underlying topology. The routers run a distributed algorithm which specifies the way to go from a node of the network to anot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of applied and computational topology
سال: 2021
ISSN: ['2367-1726', '2367-1734']
DOI: https://doi.org/10.1007/s41468-021-00083-1